A parameter-less genetic algorithm
نویسندگان
چکیده
From the user’s point of view, setting the parameters of a genetic algorithm (GA) is far from a trivial task. Moreover, the user is typically not interested in population sizes, crossover probabilities, selection rates, and other GA technicalities. He is just interested in solving a problem, and what he would really like to do, is to hand-in the problem to a blackbox algorithm, and simply press a start button. This paper explores the development of a GA that fulfills this requirement. It has no parameters whatsoever. The development of the algorithm takes into account several aspects of the theory of GAs, including previous research work on population sizing, the schema theorem, building block mixing, and genetic drift.
منابع مشابه
A parameter-tuned genetic algorithm for vendor managed inventory model for a case single-vendor single-retailer with multi-product and multi-constraint
This paper develops a single-vendor single-retailer supply chain for multi-product. The proposed model is based on Vendor Managed Inventory (VMI) approach and vendor uses the retailer's data for better decision making. Number of orders and available capital are the constraints of the model. In this system, shortages are backordered; therefore, the vendor’s warehouse capacity is another limitati...
متن کاملTuning Shape Parameter of Radial Basis Functions in Zooming Images using Genetic Algorithm
Image zooming is one of the current issues of image processing where maintaining the quality and structure of the zoomed image is important. To zoom an image, it is necessary that the extra pixels be placed in the data of the image. Adding the data to the image must be consistent with the texture in the image and not to create artificial blocks. In this study, the required pixels are estimated ...
متن کاملUsing a combination of genetic algorithm and particle swarm optimization algorithm for GEMTIP modeling of spectral-induced polarization data
The generalized effective-medium theory of induced polarization (GEMTIP) is a newly developed relaxation model that incorporates the petro-physical and structural characteristics of polarizable rocks in the grain/porous scale to model their complex resistivity/conductivity spectra. The inversion of the GEMTIP relaxation model parameter from spectral-induced polarization data is a challenging is...
متن کاملNon-linear Fractional-Order Chaotic Systems Identification with Approximated Fractional-Order Derivative based on a Hybrid Particle Swarm Optimization-Genetic Algorithm Method
Although many mathematicians have searched on the fractional calculus since many years ago, but its application in engineering, especially in modeling and control, does not have many antecedents. Since there are much freedom in choosing the order of differentiator and integrator in fractional calculus, it is possible to model the physical systems accurately. This paper deals with time-domain id...
متن کاملExergoeconomic analysis and genetic algorithm power optimization of an irreversible regenerative Brayton cycle
In this study, the performance of an irreversible regenerative Brayton cycle is sought through power maximizations using finite-time thermodynamic concept in finite-size components. Optimizations are performed using a genetic algorithm. In order to take into account the finite-time and finite-size concepts in the current problem, a dimensionless mass-flow rate parameter is used to deploy ti...
متن کاملOptimization of Meshless Local Petrov-Galerkin Parameters using Genetic Algorithm for 3D Elasto-static Problems (TECHNICAL NOTE)
A truly Meshless Local Petrov-Galerkin (MLPG) method is developed for solving 3D elasto-static problems. Using the general MLPG concept, this method is derived through the local weak forms of the equilibrium equations, by using a test function, namely, the Heaviside step function. The Moving Least Squares (MLS) are chosen to construct the shape functions. The penalty approach is used to impose ...
متن کامل